/*
day66
2019.11.2
*/
#include<vector>
#include<queue>
#include<iostream>
using namespace std;
using std::endl;

class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};


class Solution {
public:
    int maxDepth(Node* root) {
        if(!root) return 0;
        
        int max=0;
        
        for(auto child : root->children)
        {
        	int cur = maxDepth(child);
			max =  cur > max ? cur : max;
		}
		
		return 1 + max;
    }
    

};


int main()
{
	queue<int> q;
	q.push(1);
	cout<<q.front();
	cout<<q.size()<<endl; 
	return 0;
}
